* Step 1: Bounds WORST_CASE(?,O(n^1))
+ Considered Problem:
- Strict TRS:
U11(mark(X1),X2) -> mark(U11(X1,X2))
U11(ok(X1),ok(X2)) -> ok(U11(X1,X2))
U12(mark(X)) -> mark(U12(X))
U12(ok(X)) -> ok(U12(X))
U21(mark(X1),X2,X3) -> mark(U21(X1,X2,X3))
U21(ok(X1),ok(X2),ok(X3)) -> ok(U21(X1,X2,X3))
U22(mark(X1),X2) -> mark(U22(X1,X2))
U22(ok(X1),ok(X2)) -> ok(U22(X1,X2))
U23(mark(X)) -> mark(U23(X))
U23(ok(X)) -> ok(U23(X))
U31(mark(X1),X2) -> mark(U31(X1,X2))
U31(ok(X1),ok(X2)) -> ok(U31(X1,X2))
U32(mark(X)) -> mark(U32(X))
U32(ok(X)) -> ok(U32(X))
U41(mark(X1),X2,X3) -> mark(U41(X1,X2,X3))
U41(ok(X1),ok(X2),ok(X3)) -> ok(U41(X1,X2,X3))
U42(mark(X1),X2) -> mark(U42(X1,X2))
U42(ok(X1),ok(X2)) -> ok(U42(X1,X2))
U43(mark(X)) -> mark(U43(X))
U43(ok(X)) -> ok(U43(X))
U51(mark(X1),X2,X3) -> mark(U51(X1,X2,X3))
U51(ok(X1),ok(X2),ok(X3)) -> ok(U51(X1,X2,X3))
U52(mark(X1),X2) -> mark(U52(X1,X2))
U52(ok(X1),ok(X2)) -> ok(U52(X1,X2))
U53(mark(X)) -> mark(U53(X))
U53(ok(X)) -> ok(U53(X))
U61(mark(X1),X2) -> mark(U61(X1,X2))
U61(ok(X1),ok(X2)) -> ok(U61(X1,X2))
U62(mark(X)) -> mark(U62(X))
U62(ok(X)) -> ok(U62(X))
U71(mark(X1),X2) -> mark(U71(X1,X2))
U71(ok(X1),ok(X2)) -> ok(U71(X1,X2))
U72(mark(X)) -> mark(U72(X))
U72(ok(X)) -> ok(U72(X))
__(X1,mark(X2)) -> mark(__(X1,X2))
__(mark(X1),X2) -> mark(__(X1,X2))
__(ok(X1),ok(X2)) -> ok(__(X1,X2))
and(mark(X1),X2) -> mark(and(X1,X2))
and(ok(X1),ok(X2)) -> ok(and(X1,X2))
isList(ok(X)) -> ok(isList(X))
isNeList(ok(X)) -> ok(isNeList(X))
isNePal(ok(X)) -> ok(isNePal(X))
isPal(ok(X)) -> ok(isPal(X))
isPalListKind(ok(X)) -> ok(isPalListKind(X))
isQid(ok(X)) -> ok(isQid(X))
proper(a()) -> ok(a())
proper(e()) -> ok(e())
proper(i()) -> ok(i())
proper(nil()) -> ok(nil())
proper(o()) -> ok(o())
proper(tt()) -> ok(tt())
proper(u()) -> ok(u())
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Signature:
{U11/2,U12/1,U21/3,U22/2,U23/1,U31/2,U32/1,U41/3,U42/2,U43/1,U51/3,U52/2,U53/1,U61/2,U62/1,U71/2,U72/1,__/2
,and/2,isList/1,isNeList/1,isNePal/1,isPal/1,isPalListKind/1,isQid/1,proper/1,top/1} / {a/0,active/1,e/0,i/0
,mark/1,nil/0,o/0,ok/1,tt/0,u/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {U11,U12,U21,U22,U23,U31,U32,U41,U42,U43,U51,U52,U53,U61
,U62,U71,U72,__,and,isList,isNeList,isNePal,isPal,isPalListKind,isQid,proper,top} and constructors {a,active
,e,i,mark,nil,o,ok,tt,u}
+ Applied Processor:
Bounds {initialAutomaton = minimal, enrichment = match}
+ Details:
The problem is match-bounded by 2.
The enriched problem is compatible with follwoing automaton.
U11_0(2,2) -> 1
U11_1(2,2) -> 3
U12_0(2) -> 1
U12_1(2) -> 3
U21_0(2,2,2) -> 1
U21_1(2,2,2) -> 3
U22_0(2,2) -> 1
U22_1(2,2) -> 3
U23_0(2) -> 1
U23_1(2) -> 3
U31_0(2,2) -> 1
U31_1(2,2) -> 3
U32_0(2) -> 1
U32_1(2) -> 3
U41_0(2,2,2) -> 1
U41_1(2,2,2) -> 3
U42_0(2,2) -> 1
U42_1(2,2) -> 3
U43_0(2) -> 1
U43_1(2) -> 3
U51_0(2,2,2) -> 1
U51_1(2,2,2) -> 3
U52_0(2,2) -> 1
U52_1(2,2) -> 3
U53_0(2) -> 1
U53_1(2) -> 3
U61_0(2,2) -> 1
U61_1(2,2) -> 3
U62_0(2) -> 1
U62_1(2) -> 3
U71_0(2,2) -> 1
U71_1(2,2) -> 3
U72_0(2) -> 1
U72_1(2) -> 3
___0(2,2) -> 1
___1(2,2) -> 3
a_0() -> 2
a_1() -> 3
active_0(2) -> 2
active_1(2) -> 4
active_2(3) -> 5
and_0(2,2) -> 1
and_1(2,2) -> 3
e_0() -> 2
e_1() -> 3
i_0() -> 2
i_1() -> 3
isList_0(2) -> 1
isList_1(2) -> 3
isNeList_0(2) -> 1
isNeList_1(2) -> 3
isNePal_0(2) -> 1
isNePal_1(2) -> 3
isPal_0(2) -> 1
isPal_1(2) -> 3
isPalListKind_0(2) -> 1
isPalListKind_1(2) -> 3
isQid_0(2) -> 1
isQid_1(2) -> 3
mark_0(2) -> 2
mark_1(3) -> 1
mark_1(3) -> 3
nil_0() -> 2
nil_1() -> 3
o_0() -> 2
o_1() -> 3
ok_0(2) -> 2
ok_1(3) -> 1
ok_1(3) -> 3
ok_1(3) -> 4
proper_0(2) -> 1
proper_1(2) -> 4
top_0(2) -> 1
top_1(4) -> 1
top_2(5) -> 1
tt_0() -> 2
tt_1() -> 3
u_0() -> 2
u_1() -> 3
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
+ Considered Problem:
- Weak TRS:
U11(mark(X1),X2) -> mark(U11(X1,X2))
U11(ok(X1),ok(X2)) -> ok(U11(X1,X2))
U12(mark(X)) -> mark(U12(X))
U12(ok(X)) -> ok(U12(X))
U21(mark(X1),X2,X3) -> mark(U21(X1,X2,X3))
U21(ok(X1),ok(X2),ok(X3)) -> ok(U21(X1,X2,X3))
U22(mark(X1),X2) -> mark(U22(X1,X2))
U22(ok(X1),ok(X2)) -> ok(U22(X1,X2))
U23(mark(X)) -> mark(U23(X))
U23(ok(X)) -> ok(U23(X))
U31(mark(X1),X2) -> mark(U31(X1,X2))
U31(ok(X1),ok(X2)) -> ok(U31(X1,X2))
U32(mark(X)) -> mark(U32(X))
U32(ok(X)) -> ok(U32(X))
U41(mark(X1),X2,X3) -> mark(U41(X1,X2,X3))
U41(ok(X1),ok(X2),ok(X3)) -> ok(U41(X1,X2,X3))
U42(mark(X1),X2) -> mark(U42(X1,X2))
U42(ok(X1),ok(X2)) -> ok(U42(X1,X2))
U43(mark(X)) -> mark(U43(X))
U43(ok(X)) -> ok(U43(X))
U51(mark(X1),X2,X3) -> mark(U51(X1,X2,X3))
U51(ok(X1),ok(X2),ok(X3)) -> ok(U51(X1,X2,X3))
U52(mark(X1),X2) -> mark(U52(X1,X2))
U52(ok(X1),ok(X2)) -> ok(U52(X1,X2))
U53(mark(X)) -> mark(U53(X))
U53(ok(X)) -> ok(U53(X))
U61(mark(X1),X2) -> mark(U61(X1,X2))
U61(ok(X1),ok(X2)) -> ok(U61(X1,X2))
U62(mark(X)) -> mark(U62(X))
U62(ok(X)) -> ok(U62(X))
U71(mark(X1),X2) -> mark(U71(X1,X2))
U71(ok(X1),ok(X2)) -> ok(U71(X1,X2))
U72(mark(X)) -> mark(U72(X))
U72(ok(X)) -> ok(U72(X))
__(X1,mark(X2)) -> mark(__(X1,X2))
__(mark(X1),X2) -> mark(__(X1,X2))
__(ok(X1),ok(X2)) -> ok(__(X1,X2))
and(mark(X1),X2) -> mark(and(X1,X2))
and(ok(X1),ok(X2)) -> ok(and(X1,X2))
isList(ok(X)) -> ok(isList(X))
isNeList(ok(X)) -> ok(isNeList(X))
isNePal(ok(X)) -> ok(isNePal(X))
isPal(ok(X)) -> ok(isPal(X))
isPalListKind(ok(X)) -> ok(isPalListKind(X))
isQid(ok(X)) -> ok(isQid(X))
proper(a()) -> ok(a())
proper(e()) -> ok(e())
proper(i()) -> ok(i())
proper(nil()) -> ok(nil())
proper(o()) -> ok(o())
proper(tt()) -> ok(tt())
proper(u()) -> ok(u())
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))
- Signature:
{U11/2,U12/1,U21/3,U22/2,U23/1,U31/2,U32/1,U41/3,U42/2,U43/1,U51/3,U52/2,U53/1,U61/2,U62/1,U71/2,U72/1,__/2
,and/2,isList/1,isNeList/1,isNePal/1,isPal/1,isPalListKind/1,isQid/1,proper/1,top/1} / {a/0,active/1,e/0,i/0
,mark/1,nil/0,o/0,ok/1,tt/0,u/0}
- Obligation:
innermost runtime complexity wrt. defined symbols {U11,U12,U21,U22,U23,U31,U32,U41,U42,U43,U51,U52,U53,U61
,U62,U71,U72,__,and,isList,isNeList,isNePal,isPal,isPalListKind,isQid,proper,top} and constructors {a,active
,e,i,mark,nil,o,ok,tt,u}
+ Applied Processor:
EmptyProcessor
+ Details:
The problem is already closed. The intended complexity is O(1).
WORST_CASE(?,O(n^1))